| Gary Miller | |
|---|---|
Gary Miller (left) with Volker Strassen
|
|
| Residence | Pittsburgh |
| Institutions | Carnegie Mellon University |
| Doctoral advisor | Manuel Blum |
| Doctoral students | Susan Landau Tom Leighton Shang-Hua Teng Jonathan Shewchuk |
| Known for | Miller–Rabin primality test |
| Notable awards | Paris Kanellakis Award (2003) |
Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 2003, he won the ACM Paris Kanellakis Award (with three others) for the Miller–Rabin primality test. He was also made an ACM Fellow in 2002.[1]
Miller received his Ph.D. from the University of California, Berkeley in 1975 under the direction of Manuel Blum. His Ph.D. thesis was titled Riemann's Hypothesis and Tests for Primality.
Apart from computational number theory and primality testing, he has worked in the areas of computational geometry, scientific computing, parallel algorithms and randomized algorithms. Among his Ph.D. students are Susan Landau, Tom Leighton, Shang-Hua Teng, and Jonathan Shewchuk.
|
|||||